Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

Some New Results on Cordial Labeling in the Context of Arbitrary Supersubdivision of Graph

In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph. We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit cordial labeling. In addition to this we prove that the graph obtained by arbitrary supersubdivision of cycle is cordial except when n and all mi are simultaneously odd numbers. Mathematics Subject Classifi...

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

Graceful labelling of arbitrary Supersubdivision of disconnected graph

In this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful.

The Maximum Number of Edges in a Strongly Multiplicative Graph

Strongly Multiplicative Labeling of Some Snake Related Graphs

Abstract: A graph G with p vertices is said to be strongly multiplicative if the vertices of G can be labeled with p consecutive positive integers 1, 2, ..., p such that label induced on the edges by the product of labels of end vertices are all distinct. In this paper we investigate strongly multiplicative labeling of some snake related graphs. We prove that alternate triangular snake and alte...